Normal forms of deterministic grammars

Context-Free Grammars: Covers, Normal Forms, and Parsing

Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the obligation to support reading. What about now? Do you still love reading? Is reading only for you who have obligation? Absolutely not! We here offer you a new book enPDFd context free grammars covers nor...

Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity

Normal forms for linear displacement context-free grammars

In this paper we prove several results on normal forms for linear displacement context-free grammars. The results themselves are rather simple and use well-known techniques, but they are extensively used in more complex constructions. Therefore this article mostly serves educational and referential purposes. 1 Displacement context-free grammars Displacement context-free grammars (DCFGs) are a r...

Deterministic graph grammars

Context-free grammars are one of the most classical and fundamental notions in computer science textbooks, in both theoretical and applied settings. As characterizations of the well-known class of context-free languages, they are a very prominent tool in the field of language theory. Since contextfree grammars are powerful enough to express most programming languages, they also play an importan...

Strict Deterministic Aspects of Minimalist Grammars

The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an association between a vocabulary element and complex of features, and so the “yields” or “fringes” of the derivation trees are sequences of these lexical items, and the string parts of these lexical items are reordered in the...